Auction Method and its Performance in a Dynamic Bandwidth Allocation Service

نویسندگان

  • Eiji TAKAHASHI
  • Yoshiaki TANAKA
چکیده

In leased line services used by ISPs (Internet Service Providers) the bandwidth is fixed, but the traffic changes dynamically. To address this, we propose an auction method for the dynamic allocation of bandwidth to ISPs sharing backbone networks. By the method, backbone networks can be used effectively as each ISP is able to secure bandwidth according to its own policy. The Internet users can also be expected to receive good services, as it has been made possible for them to get all information about all ISPs, such as access fee and QoS provided, and to select their congenial ISPs among all ISPs according to this information. In this paper, we compare a dynamic bandwidth allocation service (dynamic allocation of bandwidth to ISPs) with a leased line service (fixed allocation of bandwidth to ISPs) by using the users’ utility to estimate the effectiveness of the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parnian: a Two-stage Nested-auction for Dynamic Bandwidth Allocation in Ethernet Passive Optical Networks

One of the key challenges in next generation access networks based on Ethernet Passive Optical Network (EPON) technology is Dynamic Bandwidth Allocation (DBA) process. In this paper we have proposed ‘Parnian’, a two-stage nested-auction for dynamic bandwidth allocation management in Ethernet Passive Optical Networks. In the proposed ‘Parnian’ method, by running nested auction, based on EPON arc...

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

A Novel K-out-of-N Auction Mechanism and Strategic Scaling for Dynamic Bandwidth Allocation in GE-PON

Dynamic bandwidth allocation for upstream transmission in EPONs has gathered significant attention. Maximizing utilization is inversely related to dynamic bandwidth allocation. We propose an auctioning mechanism for bandwidth allocation with a view to dissolution of the paradox between efficiency (utilization) and dynamism. While conventional bandwidth auctioning schemes pose efficiency as well...

متن کامل

On-line Dynamic Bandwidth Allocation

Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these guarantees as efficiently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000